Sequences of Primitive and Non-primitive BCH Codes
نویسندگان
چکیده
منابع مشابه
The Minimum Distance of Some Narrow-Sense Primitive BCH Codes
Due to wide applications of BCH codes, the determination of their minimum distance is of great interest. However, this is a very challenging problem for which few theoretical results have been reported in the last four decades. Even for the narrow-sense primitive BCH codes, which form the most well-studied subclass of BCH codes, there are very few theoretical results on the minimum distance. In...
متن کاملOn primitive BCH codes with unequal error protection capabilities
where H i m ) = -mlog2 ( U ) (1 crjlog, (1 a). In this correspondence we present new estimates of the relative error term improving the known results. Our approach is based on investigating upper bounds for absolute values of Krawtchouk polynomials. Actually, this is just a refinement of an idea due to P. Sol6 [ 161. The bounds obtained are quite tight. Particularly, for t fixed our estimate is...
متن کاملThe dimension and minimum distance of two classes of primitive BCH codes
Reed-Solomon codes, a type of BCH codes, are widely employed in communication systems, storage devices and consumer electronics. This fact demonstrates the importance of BCH codes – a family of cyclic codes – in practice. In theory, BCH codes are among the best cyclic codes in terms of their error-correcting capability. A subclass of BCH codes are the narrow-sense primitive BCH codes. However, ...
متن کاملOn the Dimension, Minimum Distance, and Duals of Primitive BCH Codes
We determine the dimension and in some cases the minimum distance of primitive, narrow sense BCH codes of length n with small designed distance. We show that such a code contains its Euclidean dual code and, when the size of the field is a perfect square, also its Hermitian dual code. We establish two series of quantum error-correcting codes.
متن کاملUndetected error probabilities of binary primitive BCH codes for both error correction and detection
In this paper, we investigate the undetected error probabilities for bounded-distance decoding of binary primitive BCH codes when they are used for both error correction and detection on a binary symmetric channel. We show that the undetected error probability of binary linear codes can be quite simplified and quantified if weight distribution of the code is binomial-like. We obtain bounds on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TEMA (São Carlos)
سال: 2018
ISSN: 2179-8451,1677-1966
DOI: 10.5540/tema.2018.019.02.369